Modern cryptology
نویسندگان
چکیده
Cryptography is an ancient discipline. Messages were already being encrypted in the archaic period of Greece. One of these, dating from the sixth century BC, consisted of wrapping a roll of paper around a cylinder and then writing the message on the paper. The unrolled paper was then sent off to the receiver, who could easily decrypt the message if he knew the diameter of the original cylinder. For many years, Cryptography was the exclusive reserve of military and diplomatic circles. Literature on the subject was very limited. The first fundamental publication was the 1949 article of Claude Shannon -“The communication theory of secrecy systems” [Sha]which lays down a mathematical basis for cryptographic systems, beginning with the definition of a new model : Information Theory. Feistel made a significant subsequent contribution with the publication in the beginning of the seventies of his work on iterative block-cipher systems [Fei1, Fei2]. This led to the DES encryption algorithm being proposed in 1997 as a secret-key encryption standard for non-classified applications. The increase in computer power challenged the security of DES, which was replaced by a new standard called AES in October 2000. This algorithm is the result of recent research, especially in Cryptanalysis. But the major advance in Cryptography was incontestably the 1976 publication of “New directions in cryptography” [Dif], by Whitfield Diffie and Martin Hellman. This article introduced the revolutionary concept of public-key cryptography. Even though the authors did not give a practical realisation of a public-key system, the properties were nonetheless clearly enunciated. Moreover, they presented a protocol by which two entities could agree a secret key from preliminary knowledge of public data only. The first realisation of a public-key system was due to Ronald Rivest, Adi Shamir and Leonard Adleman in 1978 : the RSA system [Riv]. Since then, the literature on this topic has not ceased to develop. More recently, Cryptography has had to offer additional capabilities in order to meet new threats arising from the development of information networks and the massive digitisation of documents. The principal examples of these capabilities are guaranteeing the authenticity of messages (their provenance and their contents) and certifying a person’s identity. The former are realised by digital signature algorithms and the latter by identification techniques. This introductory article presents first of all the two principal categories of cryptographic procedures which are most frequently used: encryption algorithms, which serve to protect the confidentiality of data and signature algorithms which, just like handwritten signatures, guarantee the provenance and the integrity of messages. The article details several practical implementation aspects of these procedures. It must be noted that the desired capabilities of a particular application need to be listed in advance before looking for an appropriate cryptographic solution.
منابع مشابه
Hardware Implementation of the SHA-3 Candidate Skein
Skein is a submission to the NIST SHA-3 hash function competition which has been optimized towards implementation in modern 64-bit processor architectures. This paper investigates the performance characteristics of a high-speed hardware implementation of Skein with a 0.18 μm standard-cell library and on different modern FPGAs. The results allow a first comparison of the hardware performance fig...
متن کاملCountermeasures for the Simple Branch Prediction Analysis
Branch Prediction Analysis has been proposed as an attack method to obtain key bits from a cryptographic application. In this report, we put forth several solutions to avoid or prevent this attack. The reported countermeasures require only minimal hardware support that is commonly available in modern superscalar processors.
متن کاملTRS-80 with a grain of salt
This paper presents early results of a (very) experimental implementation of the elliptic curve and stream cipher calculations of the Networking and Cryptography library (NaCl), on the TRS-80 Model I. Needless to say, the demonstration that such a library, which has been optimized for many modern platforms including leading edge desktops, servers and, recently, modern microcontrollers, is even ...
متن کاملTwisting Edwards curves with isogenies
Edwards’ elliptic curve form is popular in modern cryptographic implementations thanks to their fast, strongly unified addition formulas. Twisted Edwards curves with a = −1 are slightly faster, but their addition formulas are not complete over Fp where p ≡ 3 (mod 4). In this short note, we propose that designers specify Edwards curves, but implement scalar multiplications and the like using an ...
متن کاملOn Post-Modern Cryptography
This essay relates to a recent article of Koblitz&Menezes that “criticizes several typical ‘provable security’ results” and argues that the “theorem-proof paradigm of theoretical mathematics is often of limited relevance” to cryptography. Although it should be obvious that these claims are utterly wrong, we undertake articulating this triviality. In particular, we point out some of the fundamen...
متن کاملDynamic MDS Matrices for Substantial Cryptographic Strength
Ciphers get their strength from the mathematical functions of confusion and diffusion, also known as substitution and permutation. These were the basics of classical cryptography and they are still the basic part of modern ciphers. In block ciphers diffusion is achieved by the use of Maximum Distance Separable (MDS) matrices. In this paper we present some methods for constructing dynamic (and r...
متن کامل